Cluster Continuous Time Random Walks
نویسنده
چکیده
In a continuous time random walk (CTRW), a random waiting time precedes each random jump. The CTRW model is useful in physics, to model diffusing particles. Its scaling limit is a time-changed process, whose densities solve an anomalous diffusion equation. This paper develops limit theory and governing equations for cluster CTRW, in which a random number of jumps cluster together into a single jump. The clustering introduces a dependence between the waiting times and jumps that significantly affects the asymptotic limit. Vector jumps are considered, along with oracle CTRW, where the process anticipates the next jump.
منابع مشابه
Two random walks on the open cluster of Z meet infinitely often
We prove that two independent continuous-time simple random walks on the infinite open cluster of a Bernoulli bond percolation in the lattice Z meet each other infinitely many times. An application to the voter model is also discussed. 2000 MR subject classification: 60K
متن کاملGeneralized Mittag-Leffler relaxation: clustering-jump continuous-time random walk approach.
A stochastic generalization of renormalization-group transformation for continuous-time random walk processes is proposed. The renormalization consists in replacing the jump events from a randomly sized cluster by a single renormalized (i.e., overall) jump. The clustering of the jumps, followed by the corresponding transformation of the interjump time intervals, yields a new class of coupled co...
متن کاملClosed-form solutions for continuous time random walks on finite chains.
Continuous time random walks (CTRWs) on finite arbitrarily inhomogeneous chains are studied. By introducing a technique of counting all possible trajectories, we derive closed-form solutions in Laplace space for the Green's function (propagator) and for the first passage time probability density function (PDF) for nearest neighbor CTRWs in terms of the input waiting time PDFs. These solutions a...
متن کاملRefined estimates for some basic random walks on the symmetric and alternating groups
We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups Sn and An. We consider the following models: random transposition, transpose top with random, random insertion, and walks generated by the uniform measure on a conjugacy class. In the case of random walks on Sn and An generated by the uniform measure on...
متن کاملDiscrete-time random walks on diagrams (graphs) with cycles.
After a review of the diagram method for continuous-time random walks on graphs with cycles, the method is extended to discrete-time random walks. The basic theorems carry over formally from continuous time to discrete time. Three problems in tennis probabilities are used to illustrate random walks on discrete-time diagrams with cycles.
متن کامل